Progress on Agent Coordination with Cooperative Auctions

نویسندگان

  • Sven Koenig
  • Pinar Keskinocak
  • Craig A. Tovey
چکیده

Auctions are promising decentralized methods for teams of agents to allocate and re-allocate tasks among themselves in dynamic, partially known and time-constrained domains with positive or negative synergies among tasks. Auctionbased coordination systems are easy to understand, simple to implement and broadly applicable. They promise to be efficient both in communication (since agents communicate only essential summary information) and in computation (since agents compute their bids in parallel). Artificial intelligence research has explored auction-based coordination systems since the early work on contract networks (Smith 1980), mostly from an experimental perspective. This overview paper describes our recent progress towards creating a framework for the design and analysis of cooperative auctions for

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Auction-Based Agent Negotiation via Programmable Tuple Spaces

Auctions are proposed as a distributed negotiation mean, particularly useful in multiagent systems where both cooperative and self-interested agents compete for resources and services. The aim of this paper is to show how auction mechanisms on the Internet can be easily implemented by using programmable tuple spaces. Tuple spaces are shared repositories of information that follow the Linda mode...

متن کامل

Fast Winner Determination for Agent Coordination with SBB Auctions∗ (Extended Abstract)

The runtime of winner determination for each round of a sequential bundle-bid auction (= SBB auction) has recently been shown to be linear in the number of submitted bids, which makes SBB auctions appealing for solving cooperative task-assignment problems. In this paper, we introduce the Shrewd (= SHrewd Resource Efficient Winner Determination) algorithm, whose runtime is linear in the number o...

متن کامل

Fast winner determination for agent coordination with SBB auctions

The runtime of winner determination for each round of a sequential bundle-bid auction (= SBB auction) has recently been shown to be linear in the number of submitted bids, which makes SBB auctions appealing for solving cooperative task-assignment problems. In this paper, we introduce the Shrewd (= SHrewd Resource Efficient Winner Determination) algorithm, whose runtime is linear in the number o...

متن کامل

Designing of Supply Chain Coordination Mechanism with Leadership Considering (RESEARCH NOTE)

Abstract   Vertical cooperative (co-op) advertising is typically a cost sharing mechanism and coordinated effort by the channel’s members in order to increase demand and overall profits. In this marketing strategy, the manufacturer shares a fraction of the retailer’s advertising investment. This paper studies the advertising and pricing decisions in a retailer-manufacturer supply chain in which...

متن کامل

The Power of Sequential Single-Item Auctions for Agent Coordination

Teams of robots are more fault tolerant than single robots, and auctions appear to be promising means for coordinating them. In a recent paper at “Robotics: Science and Systems 2005,” we analyzed a coordination system based on sequential single-item auctions. We showed that the coordination system is simple to implement and computation and communication efficient, and that the resulting sum of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010